|
課程名稱 |
資料結構與程式設計
Data Structure and Programming |
|
開課學期 |
108-1 |
|
授課對象 |
電機資訊學院 電機工程學系 |
|
授課教師 |
黃鐘揚 |
|
課號 |
EE3011 |
|
課程識別碼 |
901 31900 |
|
班次 |
|
|
學分 |
3.0 |
|
全/半年 |
半年 |
|
必/選修 |
選修 |
|
上課時間 |
星期三A,B,C(18:25~21:05) |
|
上課地點 |
博理113 |
|
備註 |
自108學年度起,學號B06(含)之後學生修習此課程不能核算為複選必修課。
總人數上限：120人 |
|
Ceiba 課程網頁 |
http://ceiba.ntu.edu.tw/1081_DSnP |
|
課程簡介影片 |
|
|
核心能力關聯 |
核心能力與課程規劃關聯圖 |
|
課程大綱
|
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
|
課程概述 |
In this class, you will learn the practical issues and gain the real experiences in implementing various data structures with C++ on Linux workstations.
1. Data Structure in Programming: Why is data structure (implementation) so important?
2. Programming on Linux Workstations: A peek in the real engineering world
3. C++ Advanced Features Review: When can/should I use them?
4. What is a Good Program? A software engineering point of view
5. Computational Complexity: Time and space tradeoffs
6. Memory Management: How to gain 30% performance improvement easily
7. Dynamic Array vs. Linked List: Which one is better?
8. Tree: How to search data faster than linear time?
9. Graph and Circuit: From CS to EE Applications
10. Heap, Set and Map: How to store sorted data?
11. Cache vs. Hash: Virtual memory in your program
12. Bit Vector and Matrix: All about numerical operations
13. Putting What You Learn Together: Implementing an advanced data structure (e.g. BDD) |
|
課程目標 |
. |
|
課程要求 |
1.成績評量：Homework (60%), Final Project (40%), Bonus (TBD)
2.預修課程：程式設計 (C++) |
|
預期每週課後學習時數 |
|
|
Office Hours |
|
|
指定閱讀 |
待補 |
|
參考書目 |
1. None, but you are encouraged to use any data structure or programming textbooks as references
2. Class slides: Please download and/or print out for yourself
3. Referenced papers and handouts |
|
評量方式
(僅供參考) |
|
|
週次 |
日期 |
單元主題 |
|
第1週 |
9/11 |
0. Class Introduction;
1. C++ Review Part I: The Basic: Variables, Classes, IO Streams |
|
第2週 |
9/18 |
1. C++ Review Part I: The Basic: Variables, Classes, IO Streams |
|
第3週 |
9/25 |
2. C++ Review Part II: More on Functions, Variables, Classes |
|
第4週 |
10/02 |
3. C++ Review Part III: Overloading and Polymorphism |
|
第5週 |
10/09 |
3. C++ Review Part III: Overloading and Polymorphism |
|
第6週 |
10/16 |
4. Memory Management / Exception Handling |
|
第7週 |
10/23 |
5. Computational Complexity |
|
第8週 |
10/30 |
6. Dynamic array vs. linked list |
|
第9週 |
11/06 |
7. Tree (Part I) |
|
第10週 |
11/13 |
8. Graph and Circuit |
|
第11週 |
11/20 |
9. C++ Review Part II: More on IO Streams |
|
第12週 |
11/27 |
10. Special Topic: Lex and Yacc
11. Heap, Set and Map |
|
第13週 |
12/04 |
12. Cache vs. hash |
|
第14週 |
12/11 |
FRAIG: Functionally Reduced And-Inverter Graph |
|
第15週 |
12/18 |
FRAIG: Functionally Reduced And-Inverter Graph
13. Programming on Linux Environments |
|
第16週 |
12/25 |
14. Tree (Part II) |
|
第17週 |
1/01 |
New Year's Day (No class) |
|